Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics & Algorithm")

Results 1 to 12 of 12

  • Page / 1
Export

Selection :

  • and

Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics & AlgorithmHARTMAN, Irith Ben-Arroyo; NAOR, Seffi; PENN, Michael et al.Discrete applied mathematics. 2008, Vol 156, Num 4, issn 0166-218X, 141 p.Conference Proceedings

Quasi-concave functions on meet-semilatticesKEMPNER, Yulia; MUCHNIK, Ilya.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 492-499, issn 0166-218X, 8 p.Conference Paper

Projective DNF formulae and their revisionSLOAN, Robert H; SZÖRENYI, Balazs; TURAN, György et al.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 530-544, issn 0166-218X, 15 p.Conference Paper

Equistable distance-hereditary graphsKORACH, Ephraim; PELED, Uri N; ROTICS, Udi et al.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 462-477, issn 0166-218X, 16 p.Conference Paper

The complete optimal stars-clustering-tree problemKORACH, Ephraim; STERN, Michal.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 444-450, issn 0166-218X, 7 p.Conference Paper

Games played by Boole and GaloisFRAENKEL, Aviezri S.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 420-427, issn 0166-218X, 8 p.Conference Paper

On the roots of independence polynomials of almost all very well-covered graphsLEVIT, Vadim E; MANDRESCU, Eugen.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 478-491, issn 0166-218X, 14 p.Conference Paper

The partition bargaining problemROTHBLUM, Uriel G; TANGIR, Yoav.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 428-443, issn 0166-218X, 16 p.Conference Paper

A polynomial time algorithm for solving a quality control station configuration problemPENN, Michal; RAVIV, Tal.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 412-419, issn 0166-218X, 8 p.Conference Paper

Counting truth assignments of formulas of bounded tree-width or clique-widthFISCHER, E; MAKOWSKY, J. A; RAVVE, E. V et al.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 511-529, issn 0166-218X, 19 p.Conference Paper

The k-edge intersection graphs of paths in a treeGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 451-461, issn 0166-218X, 11 p.Conference Paper

The circuit polynomial of the restricted rooted product G(r) of graphs with a bipartite core GROSENFELD, Vladimir R.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 500-510, issn 0166-218X, 11 p.Conference Paper

  • Page / 1